Searching and Sweeping Graphs: A Brief Survey
نویسنده
چکیده
This papers surveys some of the work done on trying to capture an intruder in a graph. If the intruder may be located only at vertices, the term searching is employed. If the intruder may be located at vertices or along edges, the term sweeping is employed. There are a wide variety of applications for searching and sweeping. Old results, new results and active research directions are discussed.
منابع مشابه
A survey of the studies on Gallai and anti-Gallai graphs
The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study ...
متن کاملA prototype of a sweeping surface reconstruction algorithm
In this article we present a new approach for surface reconstruction using a sweeping paradigm. The algorithm uses advancing fronts to localize triangle formation and fast 2D searching to locate closest fronts for point insertion, resulting in low execution times.
متن کاملA Brief Introduction to Hamilton Cycles in Random Graphs
We survey results concerning Hamilton cycles in random graphs. Specifically, we focus on existence results for general and regular graphs, and discuss algorithms for finding Hamilton cycles and solving related problems (that succeed with high probability).
متن کاملCombinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
The goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.
متن کاملA Survey on Efficient Clustering Methods with Effective Pruning Techniques for Probabilistic Graphs
This paper provides a survey on K-NN queries, DCR query, agglomerative complete linkage clustering and Extension of edit-distance-based definition graph algorithm and solving decision problems under uncertainty. This existing system give an beginning to Graph agglomeration aims to divide information into clusters per their similarities, and variety of algorithms are planned for agglomeration gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004